Optimizing repeater schemes for the quantum internet

The rate at which quantum communication tasks can be performed using direct transmission is fundamentally hindered by the channel loss. Quantum repeaters allow, in principle, to overcome these limitations, but their introduction necessarily adds an additional layer of complexity distribution entanglement. This - along with stochastic nature processes such as entanglement generation, Bell swaps, and distillation makes finding good repeater schemes non-trivial. We develop algorithm that efficiently perform a heuristic optimisation over subset for general platforms. find strong improvement generation comparison simpler class based on BDCZ schemes. use study three different experimental implementations ability distribute entanglement, we dub \emph{information processing} implementations, \emph{multiplexed} combinations two. this each wide range parameters settings. allows us make estimates what are most critical improve how many use, best generate